Editing of digital images, including (but not limited to) color-to-monochromatic conversion and changing the color of a monochromatic image

ABSTRACT

Color is edited using a color representation including digital values B (brightness), e and f such that B=√{square root over (D 2 +E 2 +F 2 )}, e=E/B, f=F/B, where DEF is a linear color coordinate system. Alternatively, color is represented using digital values B, C (chroma) and H (hue), where cos C=D/B and tan H=E/F. Color-to-monochromatic image conversion, or changing the color of a monochromatic image, can be accomplished by setting e and f to constant values, and possibly (not necessarily) leaving B unchanged. Alternatively, the conversion can be accomplished by setting C and H to constant values. Other features are also provided.

CROSS REFERENCE TO RELATED APPLICATIONS

The present application is a continuation-in-part of U.S. patent application Ser. No. 11/321,443, filed Dec. 28, 2005 now U.S. Pat. No. 7,489,420 by Sergey N. Bezryadin, entitled “COLOR EDITING (INCLUDING BRIGHTNESS EDITING) USING COLOR COORDINATE SYSTEMS INCLUDING SYSTEMS WITH A COORDINATE DEFINED BY A SQUARE ROOT OF A QUADRATIC POLYNOMIAL IN TRISTIMULUS VALUES AND, POSSIBLY, BY A SIGN OF A FUNCTION OF ONE OR MORE OF TRISTIMULUS VALUES”, incorporated herein by reference. The present present application is also a continuation-in-part of U.S. patent application Ser. No. 11/322,111, filed Dec. 28, 2005 now U.S. Pat. No. 7,495,800 by Sergey N. Bezryadin, entitled “COLOR COORDINATE SYSTEMS INCLUDING SYSTEMS WITH A COORDINATE DEFINED BY A SQUARE ROOT OF A QUADRATIC POLYNOMIAL IN TRISTIMULUS VALUES AND, POSSIBLY, BY A SIGN OF A FUNCTION OF ONE OR MORE OF TRISTIMULUS VALUES”, incorporated herein by reference.

BACKGROUND OF THE INVENTION

The present invention relates to editing of color and monochromatic images. A digital representation of an image can be stored in a storage device (e.g. a computer memory, a digital video recorder, or some other device). Such representation can be transmitted over a network, and can be used to display the color image on a computer monitor, a television screen, a printer, or some other device. The image can be edited using a suitable computer program.

Color is a sensation caused by electromagnetic radiation (light) entering a human eye. The light causing the color sensation is called “color stimulus”. Color depends on the radiant power and spectral composition of the color stimulus, but different stimuli can cause the same color sensation. Therefore, a large number of colors can be reproduced (“matched”) by mixing just three “primary” color stimuli, e.g. a Red, a Blue and a Green. The primary stimuli can be produced by three “primary” light beams which, when mixed and reflected from an ideal diffuse surface, produce a desired color. The color can be represented by its coordinates, which specify the intensities of the primary light beams. For example, in linear RGB color coordinate systems, a color S is represented by coordinates R, G, B which define the intensities of the respective Red, Green and Blue primary light beams needed to match the color S. If P(λ) is the radiance (i.e. the energy per unit of time per unit wavelength) of a light source generating the color S, then the RGB coordinates can be computed as:

$\begin{matrix} \begin{matrix} {R = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{r}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {G = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{g}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {B = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{b}(\lambda)}\ {\mathbb{d}\lambda}}}} \end{matrix} & (1) \end{matrix}$ where r(λ), g(λ), b(λ) are “color matching functions” (CMF's). For each fixed wavelength λ, the values r(λ), g(λ), b(λ) are respectively the R, G and B values needed to match color produced by a monochromatic light of the wavelength λ of a unit radiance. The color matching functions are zero outside of the visible range of the λ values, so the integration limits in (1) can be replaced with the limits of the visible range. The integrals in (1) can be replaced with sums if the radiance P(λ) is specified as power at discrete wavelengths. FIG. 1 illustrates the color matching functions for the 1931 CIE RGB color coordinate system for a 2° field. (CIE stands for “Commission Internationale de l'Eclairage”.) See D. Malacara, “Color Vision and Colorimetry: theory and applications” (2002), and Wyszecki & Stiles, “Color Science: concepts and Methods, Quantitative Data and Formulae” (2^(nd) Ed. 2000), both incorporated herein by reference.

The RGB system of FIG. 1 is called linear because, as shown by equations (1), the R, G, and B values are linear in P(λ). In a linear system, the intensities such as R, G, B are called “tristimulus values”.

As seen from FIG. 1, the function r(λ) can be negative, so the R coordinate can be negative. If R is negative, this means that when the color S is mixed with |R| units of the Red primary, the resulting color matches the mixture of G units of the Green primary with B units of the Blue primary.

New linear color coordinate systems can be obtained as non-degenerate linear transformations of other systems. For example, the 1931 CIE XYZ color coordinate system for a 2° field is obtained from the CIE RGB system of FIG. 1 using the following transformation:

$\begin{matrix} {{\begin{bmatrix} \begin{matrix} X \\ Y \end{matrix} \\ Z \end{bmatrix} = {A_{{RGB} - {XYZ}}\begin{bmatrix} \begin{matrix} R \\ G \end{matrix} \\ B \end{bmatrix}}}{{where}\text{:}}} & (2) \\ {A_{{RGB} - {XYZ}} = {\frac{1}{0.17697\;}\begin{bmatrix} 0.49 & 0.31 & 0.20 \\ 0.17697 & 0.81240 & 0.01063 \\ 0.00 & 0.01 & 0.99 \end{bmatrix}}} & (3) \end{matrix}$ This XYZ system does not correspond to real, physical primaries. The color matching functions x(λ), y(λ), z(λ) for this XYZ system are shown in FIG. 2. These color matching functions are defined by the same matrix A_(RGB-XYZ):

$\begin{bmatrix} \begin{matrix} {\overset{\_}{x}(\lambda)} \\ {\overset{\_}{y}(\lambda)} \end{matrix} \\ {\overset{\_}{z}(\lambda)} \end{bmatrix} = {A_{{RGB} - {XYZ}}\begin{bmatrix} \begin{matrix} {\overset{\_}{r}(\lambda)} \\ {\overset{\_}{g}(\lambda)} \end{matrix} \\ {\overset{\_}{b}(\lambda)} \end{bmatrix}}$ The tristimulus values X, Y, Z can be computed from the color matching functions in the usual way:

$\begin{matrix} \begin{matrix} {X = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{x}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {Y = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{y}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {Z = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{z}(\lambda)}\ {\mathbb{d}\lambda}}}} \end{matrix} & (4) \end{matrix}$

There are also non-linear color coordinate systems. One example is a non-linear sRGB system standardized by International Electrotechnical Commission (IEC) as IEC 61966-2-1. The sRGB coordinates can be converted to the XYZ coordinates (4) or the CIE RGB coordinates (1). Another example is HSB (Hue, Saturation, Brightness). The HSB system is based on sRGB. In the HSB system, the colors can be visualized as points of a vertical cylinder. The Hue coordinate is an angle on the cylinder's horizontal circular cross section. The pure Red color corresponds to Hue=0°; the pure Green to Hue=120°; the pure Blue to Hue=240°. The angles between 0° and 120° correspond to mixtures of the Red and the Green; the angles between 120° and 240° correspond to mixtures of the Green and the Blue; the angles between 240° and 360° correspond to mixtures of the Red and the Blue. The radial distance from the center indicates the color's Saturation, i.e. the amount of White (White means here that R=G=B). At the circumference, the Saturation is maximal, which means that the White amount is 0 (this means that at least one of the R, G, and B coordinates is 0). At the center, the Saturation is 0 because the center represents the White color (R=G=B). The Brightness is measured along the vertical axis of the cylinder, and is defined as max(R,G,B).

Different color coordinate systems are suitable for different purposes. For example, the sRGB system is convenient for rendering color on certain types of monitors which recognize the sRGB coordinates and automatically convert these coordinates into color. The HSB system is convenient for some color editing operations including brightness adjustments.

Brightness can be thought of as a degree of intensity of a color stimulus. Brightness corresponds to our sensation of an object being “bright” or “dim”. Brightness has been represented as the Y value of the XYZ system of FIG. 2, or as the maximum of the R, G and B coordinates of the sRGB coordinate system. Other representations also exist. Hue is the attribute of a color perception denoted by blue, green yellow, red, purple, and so on. See the Wyszecki & Styles book cited above, page 487. Saturation can be thought of as a measure of the white amount in the color.

It is desirable to obtain color coordinate systems which facilitate transforming a color image into a monochromatic image (for example, in order to display a color image using a monochromatic printer or monitor, or to achieve a desired visual effect). It is also desirable to change the color of a monochromatic image.

SUMMARY

Some embodiments of the present invention provide color editing techniques using novel color coordinate systems and color editing apparatus and methods. In some embodiments, one of the coordinates is defined by a square root of a quadratic polynomial in tristimulus values, e.g. by a value B=√{square root over (T₁ ²+T₂ ²+T₃ ²)} where T₁, T₂, T₃ are tristimulus values, or by the value B and the sign of one or more of T₁, T₂, T₃. In some embodiments, color-to-monochromatic conversion is facilitated. Also facilitated is changing the color of a monochromatic image.

In some embodiments, the color coordinate system has the following coordinates: B=√{square root over (T ₁ ² +T ₂ ² +T ₃ ²)} S ₂ =T ₂ /B S ₃ =T ₃ /B In this coordinate system, if the B coordinate is changed, e.g. multiplied by some number k, and S₂ and S₃ are unchanged, the color modification corresponds to multiplying the tristimulus values by k. Such color modification does not change the chromaticity coordinates T₁/(T₁+T₂+T₃), T₂/(T₁+T₂+T₃), T₃/(T₁+T₂+T₃). Therefore, B is a good representation of brightness, and S₂ and S₃ together provide a good representation of chromaticity. To convert a color image to a monochromatic image or to change the color of a monochromatic image, the coordinates S₂ and S₃ can be set to a predefined value representing the desired color (e.g. white for a black-and-white monochromatic image), and the value B can be left unchanged for each pixel. As a result, the brightness will be unchanged. Alternatively, the B coordinate can be processed to change the image brightness or contrast or achieve some other brightness-related effect.

Another embodiment uses a color coordinate system BCH in which the B coordinate is defined as above (e.g. by the value B=√{square root over (T₁ ²+T₂ ²+T₃ ²)}, or the value B and the sign of one or more of T₁, T₂, T₃). The other coordinates C and H are such that: cos C=T ₁ /B tan H=T ₃ /T ₂ In some embodiments, B represents the brightness, C represents the chroma (saturation), and H represents the hue. A color-to-monochromatic image conversion, or changing the color of a monochromatic image, can be achieved by setting C and H to predefined values representing the desired color. The B coordinate can be unchanged, or can be changed as needed for brightness-related processing.

Linear transformations of such color coordinate systems can be used to obtain other color coordinate systems suitable for the color-to-monochromatic image conversion and changing the color of a monochromatic image.

The invention is not limited to the features and advantages described above. Other features are described below. The invention is defined by the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1 and 2 are graphs of color matching functions for prior art color coordinate systems.

FIG. 3 illustrates some color coordinate systems according to some embodiments of the present invention.

FIGS. 4 and 5 are block diagrams illustrating color editing according to some embodiments of the present invention.

FIG. 6 illustrates an image edited according to some embodiments of the present invention.

FIGS. 7 and 8 are block diagrams illustrating color editing according to some embodiments of the present invention.

DESCRIPTION OF SOME EMBODIMENTS

The embodiments described in this section illustrate but do not limit the invention. The invention is defined by the appended claims.

Some embodiments of the present invention use color coordinate systems Bef and BCH which can be defined, for example, as follows. First, a linear color coordinate system DEF is defined as a linear transformation of the 1931 CIE XYZ color coordinate system of FIG. 2:

$\begin{matrix} {{\begin{bmatrix} \begin{matrix} D \\ E \end{matrix} \\ F \end{bmatrix} = {A_{{XYZ} - {DEF}}\begin{bmatrix} \begin{matrix} X \\ Y \end{matrix} \\ Z \end{bmatrix}}}{{where}\text{:}}} & (5) \\ {A_{{XYZ} - {DEF}} = \begin{bmatrix} 0.205306 & 0.712507 & 0.467031 \\ 1.853667 & {- 1.279659} & {- 0.442859} \\ {- 0.365451} & 1.011998 & {- 0.610425} \end{bmatrix}} & (6) \end{matrix}$ It has been found that for many computations, adequate results are achieved if the elements of matrix A_(XYZ-DEF) are rounded to four digits or fewer after the decimal point, i.e. the matrix elements can be computed with an error Err≦0.00005. Larger errors can also be tolerated in some embodiments. The DEF coordinate system corresponds to color matching functions d(λ), ē(λ), f(λ) which can be obtained from x(λ), y(λ), z(λ) using the same matrix A_(XYZ-DEF):

$\begin{matrix} {\begin{bmatrix} \begin{matrix} {\overset{\_}{d}(\lambda)} \\ {\overset{\_}{e}(\lambda)} \end{matrix} \\ {\overset{\_}{f}(\lambda)} \end{bmatrix} = {A_{{XYZ} - {DEF}}\begin{bmatrix} \begin{matrix} {\overset{\_}{x}(\lambda)} \\ {\overset{\_}{y}(\lambda)} \end{matrix} \\ {\overset{\_}{z}(\lambda)} \end{bmatrix}}} & (7) \end{matrix}$ By definition of the color matching functions and the tristimulus values,

$\begin{matrix} \begin{matrix} {D = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{d}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {E = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{e}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {F = {\int_{0}^{\infty}{{P(\lambda)}{\overset{\_}{f}(\lambda)}\ {\mathbb{d}\lambda}}}} \end{matrix} & (8) \end{matrix}$ As explained above, the integration can be performed over the visible range only.

As seen in FIG. 2, the color matching functions x(λ), y(λ), z(λ) are never negative. It follows from equations (4) that the X, Y, Z values are never negative. Since the first row of matrix A_(XYZ-DEF) has only positive coefficients, the function d(λ) is never negative, and the D value is also never negative.

When D>0 and E=F=0, the color is white or a shade of gray. Such colors coincide, up to a constant multiple, with the CIE D₆₅ white color standard.

If a color is produced by a monochromatic radiation with λ=700 nm (this is a red color), then F=0 and E>0.

The color matching functions d(λ), ē(λ), f(λ) form an orthonormal system in the function space L₂ on [0,∞) (or on any interval containing the visible range of the λ values if the color matching functions are zero outside of this range), that is:

$\begin{matrix} {\begin{matrix} {{\int_{0}^{\infty}{{\overset{\_}{d}(\lambda)}{\overset{\_}{e}(\lambda)}\ {\mathbb{d}\lambda}}} = {\int_{0}^{\infty}{{\overset{\_}{d}(\lambda)}{\overset{\_}{f}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {= {\int_{0}^{\infty}{{\overset{\_}{e}(\lambda)}{\overset{\_}{f}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {{= 0}\;} \end{matrix}\begin{matrix} {{\int_{0}^{\infty}{\left\lbrack {\overset{\_}{d}(\lambda)} \right\rbrack^{2}\ {\mathbb{d}\lambda}}} = {\int_{0}^{\infty}{\left\lbrack {\overset{\_}{e}(\lambda)} \right\rbrack^{2}\ {\mathbb{d}\lambda}}}} \\ {= {\int_{0}^{\infty}{\left\lbrack {\overset{\_}{f}(\lambda)} \right\rbrack^{2}\ {\mathbb{d}\lambda}}}} \\ {= K} \end{matrix}} & (9) \end{matrix}$ where K is a positive constant defined by the measurement units for the wavelength λ and the radiance P(λ). The units can be chosen so that K=1.

The integrals in (9) can be replaced with sums if the CMF's are defined at discrete λ values, i.e.:

$\begin{matrix} {\begin{matrix} {{\sum\limits_{\lambda}^{\;}{{\overset{\_}{d}(\lambda)}{\overset{\_}{e}(\lambda)}}} = {\sum\limits_{\lambda}^{\;}{{\overset{\_}{d}(\lambda)}{\overset{\_}{f}(\lambda)}}}} \\ {= {\sum\limits_{\lambda}^{\;}{{\overset{\_}{e}(\lambda)}{\overset{\_}{f}(\lambda)}}}} \\ {{= 0}\;} \end{matrix}\begin{matrix} {{\sum\limits_{\lambda}^{\;}\left\lbrack {\overset{\_}{d}(\lambda)} \right\rbrack^{2}} = {\sum\limits_{\lambda}^{\;}\left\lbrack {\overset{\_}{e}(\lambda)} \right\rbrack^{2}}} \\ {= {\sum\limits_{\lambda}^{\;}\left\lbrack {\overset{\_}{f}(\lambda)} \right\rbrack^{2}}} \\ {= K} \end{matrix}} & (10) \end{matrix}$ where the sums are taken over a discrete set of the λ values. The constant K can be different than in (9). Color matching functions will be called orthonormal herein if the satisfy the equations (9) or (10).

If S1 and S2 are two colors with DEF coordinates (D1,E1,F1) and (D2,E2,F2), a dot product of these colors can be defined as follows: <S1,S2>=D1*D2+E1*E2+F1*F2  (11) Thus, the DEF coordinate system can be thought of as a Cartesian coordinate system having mutually orthogonal axes D, E, F (FIG. 3), with the same measurement unit for each of these axes.

The dot product (11) does not depend on the color coordinate system as long as the color coordinate system is orthonormal in the sense of equations (9) or (10) and its CMF's are linear combinations of x(λ), y(λ), z(λ) (and hence of d(λ), ē(λ), f(λ)). More particularly, let T₁, T₂, T₃ be tristimulus values in a color coordinate system whose CMF's t₁ , t₂ , t₃ belong to a linear span Span( d(λ), ē(λ), f(λ)) and satisfy the conditions (9) or (10). For the case of equations (9), this means that:

$\begin{matrix} {\begin{matrix} {{\int_{0}^{\infty}{{\overset{\_}{t_{1}}(\lambda)}\ {\overset{\_}{t_{2}}(\lambda)}\ {\mathbb{d}\lambda}}} = {\int_{0}^{\infty}{{\overset{\_}{t_{1}}(\lambda)}\ {\overset{\_}{t_{3}}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {= {\int_{0}^{\infty}{{\overset{\_}{t_{2}}(\lambda)}\ {\overset{\_}{t_{3}}(\lambda)}\ {\mathbb{d}\lambda}}}} \\ {= 0} \end{matrix}\begin{matrix} {{\int_{0}^{\infty}{\left\lbrack {\overset{\_}{t_{1}}(\lambda)} \right\rbrack^{2}{\mathbb{d}\lambda}}} = {\int_{0}^{\infty}{\left\lbrack {\overset{\_}{t_{2}}(\lambda)} \right\rbrack^{2}{\mathbb{d}\lambda}}}} \\ {= {\int_{0}^{\infty}{\left\lbrack {\overset{\_}{t_{3}}(\lambda)} \right\rbrack^{2}{\mathbb{d}\lambda}}}} \\ {= K} \end{matrix}} & (12) \end{matrix}$ with the same constant K as in (9). The discrete case (10) is similar. Suppose the colors S1, S2 have the T₁T₂T₃ coordinates (T_(1.1), T_(2.1), T_(3.1)) and (T_(1.2), T_(2.2), T_(3.2)) respectively. Then the dot product (11) is the same as <S ₁ ,S ₂ >=T _(1.1) T _(1.2) +T _(2.1) T ^(2.2) +T _(3.1) T _(3.2).

The brightness B of a color S can be represented as the length (the norm) of the vector S: B=∥S∥=√{square root over (<S,S>)}=√{square root over (D ² +E ² +F ²)}  (13) The Bef color coordinate system is defined as follows: B=√{square root over (D ² +E ² +F ²)} e=E/B f=F/B  (14) If B=0 (absolute black color), then e and f can be left undefined or can be defined in any way, e.g. as zeroes.

Since D is never negative, the D, E, F values can be determined from the B, e, f values as follows: E=e×B F=f×B D=√{square root over (B ²−(e*B)²−(f*B)²)}{square root over (B ²−(e*B)²−(f*B)²)}=B√{square root over (1−e ² −f ²)}  (15)

The Bef system is convenient for brightness editing because the brightness can be changed by changing the B coordinate and leaving e and f unchanged. Thus, if it is desired to change from some value B to a value k×B for some factor k, the new Bef color coordinates B*,e*,f* can be computed as: B*=k×B e*=e f*=f  (16) Here k>1 if the brightness is to be increased, and k<1 if the brightness is to be decreased. The transformation (16) corresponds to multiplying the D, E and F values by k: D*=k×D E*=k×E F*=k×F  (17) This transformation in turn corresponds to multiplying the color's radiance P(λ) by k (see equations (4)). The radiance multiplication by k is a good model for the intuitive understanding of brightness as a measure of the intensity of the color stimulus. Also, there is no color shift in the transformation (16), i.e. the color's chromatic perception does not change.

The brightness can be changed over the whole image or over a portion of the image as desired. The brightness transformation can be performed using computer equipment known in the art. For example, in FIG. 4, a computer processor 410 receives the color coordinates B, e, f (from a memory, a network, or some other source) and also receives the factor k (which can be defined by a user via some input device, e.g. a keyboard or a mouse). The processor outputs the k×B, e, f coordinates. In some embodiments, this color editing is controlled by a user who watches the color on a monitor 420 before and after editing. To display the color on monitor 420, the processor 410 may have to convert the color from the Bef coordinate system to some other coordinate system suitable for the monitor 420, e.g. sRGB or some other system as defined by the monitor specification. The color conversion can be performed by converting the color between Bef and DEF as specified by equations (14) and (15), and between DEF and the XYZ system of FIG. 2 by equations (5) and (6). The color conversion between the XYZ coordinate system and the sRGB can be performed using known techniques.

Another color coordinate system that facilitates the brightness editing is the spherical coordinate system for the DEF space. This coordinate system BCH (Brightness, Chroma, Hue) is defined as follows (see also FIG. 3): B=√{square root over (D ² +E ² +F ²)}  (18)

C (“chroma”) is the angle between the color S and the D axis;

H (“hue”) is the angle between (i) the orthogonal projection S_(EF) of the vector S on the EF plane and (ii) the E axis.

The term “chroma” has been used to represent a degree of saturation (see Malacara's book cited above). Recall that in the HSB system, the Saturation coordinate of a color represents the white amount in the color. In the BCH system, the C coordinate of a color is a good representation of saturation (and hence of chroma) because the C coordinate represents how much the color deviates from the white color D₆₅ represented by the D axis (E=F=0).

The H coordinate of the BCH system represents the angle between the projection S_(EF) and the red color represented by the E axis, and thus the H coordinate is a good representation of hue.

Transformation from BCH to DEF can be performed as follows: D=B×cos C E=B×sin C×cos H F=B×sin C×sin H  (19)

Transformation from DEF to BCH can be performed as follows. The B coordinate can be computed as in (18). The C and H computations depend on the range of these angles. Any suitable ranges can be chosen. In some embodiments, the angle C is in the range [0,π/2], and hence C=cos⁻¹(D/B)  (20) In some embodiments, the angle H can be computed from the relationship: tan H=F/E  (21A) or tan H=f/e  (21B) where e and f are the Bef coordinates (14). For example, any of the following relations can be used: H=tan⁻¹(F/E)+α H=tan⁻¹(f/e)+α  (22) where α depends on the range of H. In some embodiments, the angle H is measured from the positive direction of the E axis, and is in the range from 0 to 2π or −π to π. In some embodiments, one of the following computations is used: H=arctg(E,F) H=arctg(e,f)  (23) where arctg is computed as shown in pseudocode in Appendix 1 at the end of this section before the claims.

Transformation from BCH to Bef can be performed as follows: B=B e=sin C×cos H f=sin C×sin H  (24) Transformation from Bef to BCH can be performed as follows: B=B C=cos⁻¹√{square root over (1 −e ² −f ²)}, or C=sin⁻¹√{square root over (e² +f ²)} H=tan⁻¹(f/e)+α (see (22)), or H=arctg(e,f) (see Appendix 1).  (25)

As with Bef, the BCH system has the property that a change in the B coordinate without changing C and H corresponds to multiplying the tristimulus values D, E, F by some constant k (see equations (17)). The brightness editing is therefore simple to perform. In FIG. 5, the brightness editing is performed like in FIG. 4, with the C and H coordinates used instead of e and f.

The Bef and BCH systems are also suitable for contrast editing. In some embodiments, the contrast is enhanced by increasing the brightness level at the image portions that are brighter than some average value B_(avg), and decreasing the brightness at the image portions that are dimmer than the average value. For the sake of illustration, suppose the image consists of a two-dimensional set of pixels with coordinates (x,y), as shown in FIG. 6. In some embodiments, the average value is the mean of the brightness values over the image:

$\begin{matrix} {B_{avg} = {\frac{1}{N}{\sum\limits_{x,y}^{\;}B_{{x,y}\;}}}} & (26) \end{matrix}$ where N is the number of the pixels in a region containing the pixel (x,y). In some embodiments, the region is a square, a rectangle, a circle, or an ellipse, and the pixel (x,y) is at the region's center. In some embodiments, the regions have the same size for different pixels, except possibly at the image boundary. In some embodiments, the radius of a circular region, or one half of each axis of an elliptical region, or one half of each side of a rectangular region, are each greater than five pixels except perhaps at the image boundary. In the Bef system, for each pixel (x,y), the new coordinates B_(x,y)*, e_(x,y)*, f_(x,y)* for the contrast adjustment are computed from the original coordinates B_(x,y,) e_(x,y,) f_(x,y) as follows: B _(x,y) *=B _(avg) ^(1−ε) ×B _(x,y) ^(ε) e _(x,y) *=e _(x,y) f _(x,y) *=f _(x,y)  (27) Here, ε is some positive constant. Of note, the equations (27) imply that:

$\begin{matrix} {\frac{B_{x,y}^{*}}{B_{avg}} = \left( \frac{B_{x,y}}{B_{avg}} \right)^{ɛ}} & (28) \end{matrix}$ Thus, if ε>1, then the contrast is increased because the brightness range is increased over the image. If ε<1, the contrast is decreased.

The contrast adjustment can be performed over pixels (x,y) of a portion of the image rather than the entire image.

Similarly, in the BCH system, the B coordinate is computed as in (27), and the C and H coordinates are unchanged: B _(x,y) *=B _(avg) ^(1−ε) ×B _(x,y) ^(ε) C _(x,y) *=C _(x,y) H _(x,y) *=H _(x,y)  (29)

In some embodiments, the transformations (27), (29) are also used to sharpen or blur the image or an image portion. The average value B_(avg) is computed over a small region containing the pixel (x,y). In some embodiments, the radius of a circular region, or one half of each axis of an elliptical region, or one half of each side of a rectangular region, are each five pixels or less except perhaps at the image boundary.

In some embodiments, the Bef and BCH systems are used to adjust a shadow portion or a highlight portion of the image (e.g. to deepen the shadow and/or brighten (highlight) a brighter image portion). As in equations (27), (29), the e and f coordinates or the C and H coordinates are unchanged. The brightness is modified as follows: B _(x,y) *=B _(x,y)×(B ₀ /B _(avg))^(ε)  (30) where:

B₀ is some pre-defined brightness level, e.g. the maximum brightness over the image;

B_(avg) is the mean brightness over a region containing the pixel (x,y);

ε is a pre-defined constant; ε is in the interval (0,1 ) if it is desired to increase the brightness range near the pixel (x,y), and thus to sharpen the image near the pixel (good results can be achieved with ε≦½); ε is negative (e.g. in the interval (−1,0)) if it is desired to reduce the sharpness range to blur the image.

The Bef and BCH systems are also convenient for converting a color image to a monochromatic image, or for changing the color of a monochromatic image. In these transformations, the brightness B can be unchanged. The transformation is performed in the Bef system by setting the e and f coordinates to some constant values e₀ and f₀, as shown in FIG. 7. More particularly, computer processor 410 receives the color coordinates B, e, f and also receives the values e₀,f₀. The processor outputs the coordinates B, e₀,f₀ for each pixel: B*=B e*=e ₀ f*=f ₀  (31)

In the BCH system, the monochromatic transformation is given by the following equations: B*=B C*=C ₀ H*=H ₀  (32) where C₀, H₀ are some input values corresponding to the desired color. Computer processor 410 (FIG. 8) receives the color coordinates B, C, H and also receives the values C₀, H₀. The processor outputs the coordinates B, C₀, H₀ for each pixel according to (32).

In some embodiments, the transformation (31) or (32) can be combined with some brightness editing. For example, in at least a portion of the image, the output brightness B* can be computed as in (16) for some input value k, or as in (26) or (28). Other brightness editing types are also possible. See e.g. U.S. patent application Ser. No. 11/377,161, entitled “EDITING (INCLUDING CONTRAST AND SHARPNESS EDITING) OF DIGITAL IMAGES”, filed on Mar. 16, 2006 by Sergey N. Bezryadin and incorporated herein by reference.

The invention includes systems and methods for color image editing and display. The Bef and BCH color coordinates can be transmitted in a data carrier such as a wireless or wired network link, a computer readable disk, or other types of computer readable media. The invention includes computer instructions that program a computer system to perform the brightness editing and color coordinate system conversions. Some embodiments of the invention use hardwired circuitry instead of, or together with, software programmable circuitry.

In some embodiments, the Bef or BCH color coordinate system can be replaced with their linear transforms, e.g. the coordinates (B+e,e,f) or (2B,2e,2f) can be used instead of (B,e,f). The angle H can be measured from the E axis or some other position. The angle C can also be measured from some other position. The invention is not limited to the order of the coordinates. The invention is not limited to DEF, XYZ, or any other color coordinate system as the initial coordinate system. In some embodiments, the orthonormality conditions (9) or (10) are replaced with quasi-orthonormality conditions, i.e. the equations (9) or (10) hold only approximately. More particularly, CMF's t₁ (λ), t₂ (λ), t₃ (λ) will be called herein quasi-orthonormal with an error at most ε if they satisfy the following conditions:

-   1. each of

${\int_{0}^{\infty}{{\overset{\_}{t_{1}}(\lambda)}{\overset{\_}{t_{2}}(\lambda)}{\mathbb{d}\lambda}}},{\int_{0}^{\infty}{{\overset{\_}{t_{1}}(\lambda)}{\overset{\_}{t_{3}}(\lambda)}{\mathbb{d}\lambda}}},{\int_{0}^{\infty}{{\overset{\_}{t_{2}}(\lambda)}{\overset{\_}{t_{3}}(\lambda)}{\mathbb{d}\lambda}}}$ is in the interval [−ε,ε], and

-   2. each of

${\int_{0}^{\infty}{\left\lbrack {\overset{\_}{t_{1}}(\lambda)} \right\rbrack^{2}{\mathbb{d}\lambda}}},{\int_{0}^{\infty}{\left\lbrack {\overset{\_}{t_{2}}(\lambda)} \right\rbrack^{2}{\mathbb{d}\lambda}}},{\int_{0}^{\infty}{\left\lbrack {\overset{\_}{t_{3}}(\lambda)} \right\rbrack^{2}{\mathbb{d}\lambda}}}$ is in the interval [K−ε,K+ε] for positive constants K and ε. In some embodiments, ε is 0.3K, or 0.1K, or some other value at most 0.3K, or some other value. Alternatively, the CMF's will be called quasi-orthonormal with an error at most ε if they satisfy the following conditions:

-   1. each of

${\sum\limits_{\lambda}^{\;}{{\overset{\_}{t_{1}}(\lambda)}{\overset{\_}{t_{2}}(\lambda)}}},{\sum\limits_{\lambda}^{\;}{{\overset{\_}{t_{1}}(\lambda)}{\overset{\_}{t_{3}}(\lambda)}}},{\sum\limits_{\lambda}^{\;}{{\overset{\_}{t_{2}}(\lambda)}{\overset{\_}{t_{3}}(\lambda)}}}$ is in the interval [−ε,ε], and

-   2. each of

${\sum\limits_{\lambda}^{\;}\left\lbrack {\overset{\_}{t_{1}}(\lambda)} \right\rbrack^{2}},{\sum\limits_{\lambda}^{\;}\left\lbrack {\overset{\_}{t_{2}}(\lambda)} \right\rbrack^{2}},{\sum\limits_{\lambda}^{\;}\left\lbrack {\overset{\_}{t_{3}}(\lambda)} \right\rbrack^{2}}$ is in the interval [K−ε,K+ε] for positive constants K and ε. In some embodiments, ε is 0.3K, or 0.1K, or some other value at most 0.3K, or some other value. Orthonormal functions are quasi-orthonormal, but the reverse is not always true. If ε=0.1K, the functions will be called 90%-orthonormal. More generally, the functions will be called n %-orthonormal if ε is (100-n)% of K. For example, for 70%-orthonormality, ε=0.3K.

The invention is not limited to the orthonormal or quasi-orthonormal CMF's or to any particular white color representation. For example, in some embodiments, the following color coordinate system (S₁,S₂,S₃) is used for color editing: S ₁=√{square root over (X ² +Y ² +Z ²)} S ₂ =X/S ₁ S ₃ =Z/S ₁  (33) The XYZ tristimulus values in (33) can be replaced with linear RGB tristimulus values or with some other tristimulus values T₁, T₂, T₃, e.g.: S ₁=√{square root over (T ₁ ² +T ₂ ² +T ₃ ²)} S ₂ =T ₂ /S ₁ S ₃ =T ₃ /S ₁.  (34) If T₁ can be negative, than the sign of T₁ can be provided in addition to the coordinates. Alternatively the sign of T₁ can be incorporated into one of the S₁, S₂, and/or S₃ values,for example: S ₁=Sign(T ₁)×√{square root over (T ₁ ² +T ₂ ² +T ₃ ²)}  (35) The brightness editing can still be performed by multiplying the S₁ coordinate by k, with the S₂ and S₃ values being unchanged.

The BCH coordinate system can be constructed from linear systems other than DEF, including orthonormal and non-orthonormal, normalized and non-normalized systems. In some embodiments, a coordinate system is used with coordinates (S₁,S₂,S₃), where S₁ is defined as in (34) or (35), and the coordinates S₂ and S₃ are defined in a way similar to (20)-(23), e.g.: S ₂=cos⁻¹(T ₁ /B) S ₃=tan⁻¹(T ₃ /T ₂)+α  (36) where α is as in (22), or S ₃ =arctg(T ₂ ,T ₃)  (37)

In some embodiments, the value B is the square root of some other quadratic polynomial of in T₁, T₂, T₃: B=√{square root over (g ₁₁ T ₁ ² +g ₂₂ T ₂ ² +g ₃₃ T ₃ ² +g ₁₂ T ₁ T ₂ +g ₁₃ T ₁ T ₃ +g ₂₃ T ₂ T ₃)} wherein g₁₁, g₂₂, g₃₃, g₁₂, g₁₃, g₂₃ are predefined constants, and g₁₁, g₂₂, g₃₃ are not equal to zero (e.g. g₁₁, g₂₂, g₃₃ are positive). Linear transforms result in different mathematical expressions of the coordinates without necessarily changing the values of the coordinates. For example, the coordinate system may use coordinates S₁, S₂, S₃ or their linear transform, wherein S₁ is defined by the value B, or S₁ is defined by B and the sign of a predefined function of one or more of T₁, T₂, T₃. In some embodiments B=√{square root over (α₁ ²(T ₁ ,T ₂ ,T ₃)+α₂ ²(T ₁ ,T ₂ ,T ₃)+α₃ ²(T ₁ ,T ₂ ,T ₃))}{square root over (α₁ ²(T ₁ ,T ₂ ,T ₃)+α₂ ²(T ₁ ,T ₂ ,T ₃)+α₃ ²(T ₁ ,T ₂ ,T ₃))}{square root over (α₁ ²(T ₁ ,T ₂ ,T ₃)+α₂ ²(T ₁ ,T ₂ ,T ₃)+α₃ ²(T ₁ ,T ₂ ,T ₃))} wherein α₁(T ₁ ,T ₂ ,T ₃)=α₁₁ ×T ₁+α₁₂ ×T ₂+α₁₃ ×T ₃ α₂(T ₁ ,T ₂ ,T ₃)=α₂₁ ×T ₁+α₂₂ ×T ₂+α₂₃ ×T ₃ α₃(T ₁ ,T ₂ ,T ₃)=α₃₁ ×T ₁+α₃₂ ×T ₂+α₃₃ ×T ₃ wherein α₁₁, α₁₂, α₁₃, α₂₁, α₂₂, α₂₃, α₃₁, α₃₂, α₃₃ are predefined numbers such that the following matrix Λis non-degenerate:

$\Lambda = \begin{bmatrix} \alpha_{11} & \alpha_{12} & \alpha_{13} \\ \alpha_{21} & \alpha_{22} & \alpha_{23} \\ \alpha_{31} & \alpha_{32} & \alpha_{33} \end{bmatrix}$ In some embodiments, the coordinate S₁ is defined by the value B and by a sign of a predefined function of one or more of T₁, T₂, T₃. The function can be one of α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃). Clearly, the values T₁′=α₁(T₁,T₂,T₃), T₂′=α₂(T₁,T₂,T₃), T₃′=α₃(T₁,T₂,T₃) are also tristimulus values. In some embodiments, the coordinate S₂ is defined by a value β(T₁,T₂,T₃)/B, wherein β(T ₁ ,T ₂ ,T ₃)=β₁ ×T ₁+β₂ ×T ₂+β₃ ×T ₃, wherein β₁, β₂, β₃ are predefined numbers at least one of which is not equal to zero, or the coordinate S₂ is defined by the value β(T₁,T₂,T₃)/B and the sign of a predefined function of one or more of T₁, T₂, T₃. The coordinate S₃ is defined by a value γ(T₁,T₂,T₃)/B, wherein γ(T ₁ ,T ₂ ,T ₃)=γ₁ ×T ₁+γ₂ ×T ₂+γ₃ ×T ₃, wherein γ₁, γ₂, γ₃ are predefined numbers at least one of which is not equal to zero, and γ(T₁,T₂,T₃) is not a multiple of β(T₁,T₂,T₃), or the coordinate S₃ is defined by the value γ(T₁,T₂,T₃)/B and the sign of a predefined function of one or more of T₁,T₂,T₃. In some embodiments, a value cos S₂ is defined by a value β(T₁,T₂,T₃)/B, wherein β(T ₁ ,T ₂ ,T ₃)=β₁ ×T ₁+β₂ ×T ₂+β₃ ×T ₃, wherein β₁, β₂, β₃ are predefined numbers at least one of which is not equal to zero, or the value cos S₂ is defined by the value β(T₁,T₂,T₃)/B and the sign of a predefined function of one or more of T₁, T₂, T₃. In some embodiments, a value tan S₃ is defined by a value γ(T₁,T₂,T₃)/δ(T₁,T₂,T₃), wherein γ(T ₁ ,T ₂ ,T ₃)=γ₁ ×T ₁+γ₂ ×T ₂+γ₃ ×T ₃, δ(T ₁ ,T ₂ ,T ₃)=δ₁ ×T ₁+δ₂ ×T ₂+δ₃ ×T ₃, wherein γ₁, γ₂, γ₃ are predefined numbers at least one of which is not equal to zero, and δ₁, δ₂, δ₃ are predefined numbers at least one of which is not equal to zero, or the value tan S₃ is defined by the value γ(T₁,T₂,T₃)/δ(T₁,T₂,T₃) and the sign of a predefined function of one or more of T₁, T₂, T₃. In some embodiments, β(T₁,T₂,T₃) is one of α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃); γ(T₁,T₂,T₃) is another one of α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃); and δ(T₁,T₂,T₃) is the third one of α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃). In some embodiments, any color whose tristimulus values T₁,T₂,T₃ are such that α₁(T₁,T₂,T₃) is not zero and α₂(T₁,T₂,T₃)=α₃(T₁,T₂,T₃)=0, is a white or a shade of gray. This can be D₆₅ or some other white color. In some embodiments, a monochromatic red color of a predefined wavelength has tristimulus values T₁, T₂, T₃ such that α₂(T₁,T₂,T₃) is positive and α₃(T₁,T₂,T₃)=0. In some embodiments, α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃) are tristimulus values corresponding to 70%-orthonormal color matching functions. In some embodiments, up to a constant multiple, Λ is an orthonorrnal matrix, i.e. ΛΛ^(T)=I, where Λ^(T) is a transpose of Λ, and I is the identity matrix, i.e.

$I = \begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}$ We will also call the matrix orthonormal if ΛΛ^(T)=c×I where c is a non-zero number. If the elements of ΛΛ^(T) are each within c×n/100 of the respective elements of a matrix c×I for some c and n, then the matrix Λ will be called (100-n)%-orthonormal. For example, if the elements of ΛΛ^(T) are each within 0.3×c of the respective elements of a matrix c×I (i.e. for each element λ_(i,j) of matrix ΛΛ^(T), |λ_(i,j)−e_(i,j)|≦0.3×c where e_(i,j) is the corresponding element of the matrix c×I), the matrix Λ will be called 70%-orthonormal. In some embodiments, the matrix Λ is 70% or more percent orthonormal (e.g. 90%-orthonormal).

The tristimulus values T₁, T₂, T₃, or the corresponding color matching functions, do not have to be normalized in any way. In some prior art systems, the color matching functions are normalized to require that the integral of each color matching function be equal to 1. In the XYZ system of FIG. 2, there is a normalizing condition X=Y=Z for a pre-defined, standard white color with a constant spectral power distribution function P(λ). The invention is not limited by any such requirements.

The invention is not limited to the two-dimensional images (as in FIG. 6). The invention is applicable to pixel (bitmap) images and to vector graphics. Colors can be specified separately for each pixel, or a color can be specified for an entire object or some other image portion. The invention is not limited to a particular way to specify the brightness transformation or any other transformations. For example, the brightness transformation can be specified by a value to be added to the brightness (B*=B+k) or in some other way. Other embodiments and variations are within the scope of the invention, as defined by the appended claims.

Appendix 1—Function arctg(a,b)

Here is a pseudocode written in a C-like language (C is a programming language). inline float arctg(const float a, const float b)

{ float res; if( FLT_EPSILON * abs(b) < abs(a) ) //FLT_EPSILON is the minimum positive number ε // such that 1-ε is different from 1 on the computer. //abs( ) is the absolute value { res = tan⁻¹ (b / a) ; if (a < 0) { res += π ; } else if (b < 0) { res += 2 π ; }; } else { if(b < 0) { res = 3/2 π ; } else { if (b > 0) { res = ½ π ; } else { res = 0 ; }; }; }; return res ; }; 

1. A circuitry-implemented method comprising image editing, the method comprising: (1) obtaining digital data for image portions p₁,p₂, . . . , wherein for each image portion p (p=p₁, p₂, . . . ), the digital data represent coordinates of a color S(p) of the portion p in a first coordinate system, wherein for a color S having tristimulus values T₁, T₂, T₃ in a second coordinate system, the coordinates of the color S in the first coordinate system comprise coordinates S₁, S₂, S₃, or a linear transformation of the coordinates S₁, S₂, S₃, wherein: (A) the coordinate S₁ is defined by a B value B=√{square root over (g₁₁ T ₁ ² +g ₂₂ T ₂ ² +g ₃₃ T ₃ ² +g ₁₂ T ₁ T ₂ +g ₁₃ T ₁ T ₃ +g ₂₃ T ₂ T ₃)} wherein g₁₁, g₂₂, g₃₃, g₁₂, g₁₃, g₂₃ are predefined constants, and g₁₁, g₂₂, g₃₃ are not equal to zero, or (B) the coordinate S₁ is defined by the B value and by a sign of a predefined function of one or more of T₁, T₂, T₃; (2) for each image portion p (p=p₁, p₂, . . . ), obtaining color coordinates in the first color coordinate system of a modified color S*(p) whose coordinates S₂, S₃ are predefined constant values independent of the portion p.
 2. The method of claim 1 wherein for each image portion p (p=p₁, p₂, . . . ), the color S*(p) has the same coordinate S₁ as the color S(p).
 3. The method of claim 1 wherein: B=√{square root over (α₁ ²(T ₁ ,T ₂ ,T ₃)+α₂ ²(T ₁ ,T ₂ ,T ₃)+α₃ ²(T ₁ ,T ₂ ,T ₃))}{square root over (α₁ ²(T ₁ ,T ₂ ,T ₃)+α₂ ²(T ₁ ,T ₂ ,T ₃)+α₃ ²(T ₁ ,T ₂ ,T ₃))}{square root over (α₁ ²(T ₁ ,T ₂ ,T ₃)+α₂ ²(T ₁ ,T ₂ ,T ₃)+α₃ ²(T ₁ ,T ₂ ,T ₃))} wherein α₁(T ₁ ,T ₂ ,T ₃)=α₁₁ ×T ₁+α₁₂ ×T ₂+α₁₃ ×T ₃ α₂(T ₁ ,T ₂ ,T ₃)=α₂₁ ×T ₁+α₂₂ ×T ₂+α₂₃ ×T ₃ α₃(T ₁ ,T ₂ ,T ₃)=α₃₁ ×T ₁+α₃₂ ×T ₂+α₃₃ ×T ₃ wherein α₁₁, α₁₂, α₁₃, α₂₁, α₂₂, α₂₃, α₃₁, α₃₂, α₃₃ are predefined numbers such that the following matrix Λ is non-degenerate: $\Lambda = {\begin{bmatrix} \alpha_{11} & \alpha_{12} & \alpha_{13} \\ \alpha_{21} & \alpha_{22} & \alpha_{23} \\ \alpha_{31} & \alpha_{32} & \alpha_{33} \end{bmatrix}.}$
 4. The method of claim 3 wherein: (C) the coordinate S₂ is defined by a value β(T₁,T₂,T₃)/B, wherein β(T ₁ ,T ₂ ,T ₃)=β₁ ×T ₁+β₂ ×T ₂+β₃ ×T ₃, wherein β₁, β₂, β₃ are predefined numbers at least one of which is not equal to zero, or the coordinate S₂ is defined by the value β(T₁,T₂,T₃)/B and the sign of said predefined function of one or more of T₁, T₂, T₃; and (D) the coordinate S₃ is defined by a value γ(T₁,T₂,T₃)/B, wherein γ(T ₁ ,T ₂ ,T ₃)=γ₁ ×T ₁+γ₂ ×T ₂+γ₃ ×T ₃, wherein γ₁, γ₂, γ₃ are predefined numbers at least one of which is not equal to zero, and γ(T₁,T₂,T₃) is not a multiple of β(T₁,T₂,T₃), or the coordinate S₃ is defined by the value γ(T₁,T₂,T₃)/B and the sign of said predefined function of one or more of T₁, T₂, T₃.
 5. The method of claim 4 wherein β(T₁,T₂,T₃) is one of α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃), and γ₂(T₁,T₂,T₃) is another one of α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃).
 6. The method of claim 3 wherein: (C) a value cos S₂ is defined by a value β(T₁,T₂,T₃)/B, wherein β(T ₁ ,T ₂ ,T ₃)=β₁ ×T ₁+β₂ ×T ₂+β₃ ×T ₃, wherein β₁, β₂, β₃ are predefined numbers at least one of which is not equal to zero, or the value cos S₂ is defined by the value β(T₁,T₂,T₃)/B and the sign of said predefined function of one or more of T₁, T₂, T₃; (D) a value tan S₃ is defined by a value γ(T₁,T₂,T₃)/δ(T₁,T₂,T₃), wherein γ(T ₁ ,T ₂ ,T ₃)=γ₁ ×T ₁+γ₂ ×T ₂+γ₃ ×T ₃, δ(T ₁ ,T ₂ ,T ₃)=δ₁ ×T ₁+δ₂ ×T ₂+δ₃ ×T ₃, wherein γ₁, γ₂, γ₃ are predefined numbers at least one of which is not equal to zero, and δ₁, δ₂, δ₃ are predefined numbers at least one of which is not equal to zero, or the value tan S₃ is defined by the value γ(T₁,T₂,T₃)/δ(T₁,T₂,T₃) and the sign of said predefined function of one or more of T₁, T₂, T₃.
 7. The method of claim 4 wherein β(T₁,T₂,T₃)=α₁(T₁,T₂,T₃); γ(T₁,T₂,T₃) is one of α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃); and δ(T₁,T₂,T₃) is the other one of α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃).
 8. The method of claim 7 wherein any color whose tristimulus values T₁,T₂,T₃ are such that β(T₁,T₂,T₃) is not zero and γ(T₁,T₂,T₃)=δ(T₁,T₂,T₃)=0, is a white or a shade of gray.
 9. The method of claim 7 wherein a monochromatic red color of a predefined wavelength has tristimulus values T₁, T₂, T₃ such that α₂ (T₁,T₂,T₃) is not zero and α₃(T₁,T₂,T₃)=0.
 10. The method of claim 3 wherein α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃) are tristimulus values corresponding to 70%-orthonormal color matching functions.
 11. The method of claim 10 wherein α₁(T₁,T₂,T₃), α₂(T₁,T₂,T₃), α₃(T₁,T₂,T₃) are tristimulus values corresponding to 90%-orthonormal color matching functions.
 12. The method of claim 10 wherein: the value T₁ is one of values D, E, F, the value T₂ is another one of D, E, F, and the value T₃ is the third one of D, E, F, where $\begin{bmatrix} \begin{matrix} D \\ E \end{matrix} \\ F \end{bmatrix} = {A\begin{bmatrix} \begin{matrix} X \\ Y \end{matrix} \\ Z \end{bmatrix}}$ where the matrix A has elements which, up to rounding, are as follows: $A = \begin{bmatrix} 0.205306 & 0.712507 & 0.467031 \\ {- 0.365451} & 1.011998 & {- 0.610425} \\ 1.853667 & {- 1.279659} & {- 0.442859} \end{bmatrix}$ where X, Y, Z are the coordinates of the color S in the CIE 1931 XYZ color coordinate system for a 2° field; wherein up to a constant multiple, Λ is a 70%-orthonormal matrix.
 13. Circuitry for performing adapted to perform the method of claim
 1. 14. One or more computer-readable mediums comprising one or more computer instructions for causing a computer system to perform the method of claim
 1. 15. Circuitry for performing the method of claim
 2. 16. One or more computer-readable mediums comprising one or more computer instructions for causing a computer system to perform the method of claim
 3. 17. Circuitry for performing the method of claim
 4. 18. One or more computer-readable mediums comprising one or more computer instructions for causing a computer system to perform the method of claim
 5. 19. Circuitry for performing the method of claim
 6. 20. One or more computer-readable mediums comprising one or more computer instructions for causing a computer system to perform the method of claim
 7. 21. A data transmission method comprising transmitting a computer program over a network link, wherein the computer program is operable to cause a computer system to perform the method of claim
 1. 22. A data transmission method comprising transmitting a computer program over a network link, wherein the computer program is operable to cause a computer system to perform the method of claim
 2. 